Geometric Containment Orders: A Survey
نویسندگان
چکیده
A partially ordered set (X,≺) is a geometric containment order of a particular type if there is a mapping from X into similarly shaped objects in a finite-dimensional Euclidean space that preserves ≺ by proper inclusion. This survey describes most of what is presently known about geometric containment orders. Highlighted shapes include angular regions, convex polygons and circles in the plane, and spheres of all dimensions. Containment orders are also related to incidence orders for vertices, edges and faces of graphs, hypergraphs, planar graphs and convex polytopes. Three measures of poset complexity are featured: order dimension, crossing number, and degrees of freedom. Mathematics Subject Classification (1991): 06A10.
منابع مشابه
Characterization and Recognition of Point-Halfspace and Related Orders
We characterize four classes of geometric membership and containment orders|structurally and in terms of forbidden subposets| and present linear-or near linear-time recognition algorithms for each class. We also show that recognizing point-halfspace orders in IR d is NP-hard for d 2.
متن کاملGeometric algorithms for containment analysis of rotational parts
This paper describes a system and underlying algorithms to perform geometric containment analysis to determine if a newly designed rotational part can be manufactured from a part in an existing database of rotational parts. Only material removal of the database part is considered in order to obtain the newly designed part from the database part. The system uses a three-step algorithm to test fo...
متن کاملGrid Intersection Graphs and Order Dimension
We study bipartite geometric intersection graphs from the perspective of order dimension. We show that partial orders of height two whose comparability graph is a grid intersection graph have order dimension at most four. Starting from this observation we look at various classes of graphs between grid intersection graph and bipartite permutations graphs and the containment relation on these cla...
متن کاملSome examples of universal and generic partial orders
We survey structures endowed with natural partial orderings and prove their universality. These partial orders include partial orders on set of words, partial orders formed by geometric objects, grammars, polynomials and homomorphism order for various combinatorial objects.
متن کاملTranslational Polygon Containment and Minimal Enclosure Using Geometric Algorithms and Mathematical Programming Translational Polygon Containment and Minimal Enclosure Using Geometric Algorithms and Mathematical Programming
We present an algorithm for the two-dimensional translational containment problem: nd translations for k polygons (with up to m vertices each) which place them inside a polygonal container (with n vertices) without overlapping. The polygons and container may be nonconvex. The containment algorithm consists of new algorithms for restriction, evaluation, and subdivision of two-dimensional conngur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999